Spanning tree

Results: 445



#Item
161CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:37
162Minimum Spanning Trees on Polyhedra Michael J. Spriggs J. Mark Keil  Department of Computer Science

Minimum Spanning Trees on Polyhedra Michael J. Spriggs J. Mark Keil Department of Computer Science

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:04:26
163CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  The Embroidery Problem Esther M. Arkin∗  Joondong Kim∗

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ Joondong Kim∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:01:57
164A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne  Abstract. CorrelationClustering is now an established problem in

A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in

Add to Reading List

Source URL: www.mit.edu

Language: English - Date: 2012-07-29 14:44:15
165Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:46
166CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  The Embroidery Problem Esther M. Arkin∗  George W. Hart†

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:07:19
167CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees Anna Lubiw∗  Mina Razaghpour†

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees Anna Lubiw∗ Mina Razaghpour†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:01:04
168Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †

Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-31 22:48:01
169CCCG 2006, Kingston, Ontario, August 14–16, 2006  Spanning trees across axis-parallel segments Michael Hoffmann∗  Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:24
170CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014  On the Spanning Ratio of Constrained Yao-Graphs Andr´e van Renssen∗  Abstract

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Spanning Ratio of Constrained Yao-Graphs Andr´e van Renssen∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-07-28 20:00:24